Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
نویسندگان
چکیده
Let f(D(i,j),di,dj) be a real function symmetric in i and j with the property that f(d,(1+o(1))np,(1+o(1))np)=(1+o(1))f(d,np,np) for d=1,2. G graph, di denote degree of vertex D(i,j) distance between vertices G. In this paper, we define f-weighted Laplacian matrix random graphs Erdös-Rényi graph model Gn,p, where p?(0,1) is fixed. Four weighted type energies: energy LEf(G), signless LEf+(G), incidence IEf(G) Laplacian-energy like invariant LELf(G) are introduced studied. We obtain asymptotic values LELf(G), LEf(G) LEf+(G) under condition dependent only on D(i,j). As consequence, get D(i,j), almost all Gp?Gn,p, degree-distance-based entries Gp, E(Wf(Gp))<LEf(Gp), matrix, which can viewed as generalization conjecture by Gutman et al.
منابع مشابه
On reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملEmpirical Distributions of Laplacian Matrices of Large Dilute Random Graphs
We study the spectral properties of the Laplacian matrices and the normalized Laplacian matrices of the Erdös-Rényi random graph G(n, pn) for large n. Although the graph is simple, we discover some interesting behaviors of the two Laplacian matrices. In fact, under the dilute case, that is, pn ∈ (0, 1) and npn → ∞, we prove that the empirical distribution of the eigenvalues of the Laplacian mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2020.11.005